Research on the Optimal Layout Problem for NC Machining Based on Improved Genetic Algorithm

نویسندگان

  • Wang Shuqing
  • Lei Lei
  • Wang Bing
چکیده

In the process of NC machining, the optimization processing of graphic layout is a well-studied problem which has practical application value for improving the utilization rate of raw materials and saving the cost of production. In this paper, a new design of genetic algorithm (GA) is proposed for solving this problem. This improved genetic algorithm combines GA with the improved crossover operator and mutation operator. Moreover, the best individual preservation method is integrated into the algorithm. The improved genetic algorithm expands the search space and enhances the GA’s search capabilities. Furthermore, the maximum matching algorithm is proposed based on the lowest horizontal line algorithm, which effectively avoids blind elevating horizontal lines and improves the utilization rate of the lowest horizontal line. It is integrated with the improved genetic algorithm to solve the two-dimensional rectangular parts optimal layout problem which combines the advantages of two kinds of algorithms. The experimental results show that the algorithm can get a good optimization result.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An empirical study on statistical analysis and optimization of EDM process parameters for inconel 718 super alloy using D-optimal approach and genetic algorithm

Among the several non-conventional processes, electrical discharge machining (EDM) is the most widely and successfully applied for the machining of conductive parts. In this technique, the tool has no mechanical contact with the work piece and also the hardness of work piece has no effect on the machining pace. Hence, this technique could be employed to machine hard materials such as super allo...

متن کامل

Optimization of Cutting Parameters Based on Production Time Using Colonial Competitive (CC) and Genetic (G) Algorithms

A properly designed machining procedure can significantly affect the efficiency of the production lines. To minimize the cost of machining process as well as increasing the quality of products, cutting parameters must permit the reduction of cutting time and cost to the lowest possible levels. To achieve this, cutting parameters must be kept in the optimal range. This is a non-linear optimizati...

متن کامل

Optimization of Cutting Parameters Based on Production Time Using Colonial Competitive (CC) and Genetic (G) Algorithms

A properly designed machining procedure can significantly affect the efficiency of the production lines. To minimize the cost of machining process as well as increasing the quality of products, cutting parameters must permit the reduction of cutting time and cost to the lowest possible levels. To achieve this, cutting parameters must be kept in the optimal range. This is a non-linear optimizati...

متن کامل

Applying Genetic Algorithm to Dynamic Layout Problem

In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...

متن کامل

Optimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II

The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013